An efficient pending interest table control management in named data network

Named Data Networking (NDN) is an emerging Internet architecture that employs a new network communication model based on the identity of Internet content. Its core component, the Pending Interest Table (PIT) serves a significant role of recording Interest packet information which is ready to be sent but in waiting for matching Data packet. In managing PIT, the issue of flow PIT sizing has been very challenging due to massive use of long Interest lifetime particularly when there is no flexible replacement policy, hence affecting PIT performance. The aim of this study is to propose an efficient PIT Control Management (PITCM) approach to be used in handling incoming Interest packets in order to mitigate PIT overflow thus enhancing PIT utilization and performance. PITCM consists of Adaptive Virtual PIT (AVPIT) mechanism, Smart Threshold Interest Lifetime (STIL) mechanism and Highest Lifetime Least Request (HLLR) policy. The AVPIT is responsible for obtaining early PIT overflow prediction and reaction. STIL is meant for adjusting lifetime value for incoming Interest packet while HLLR is utilized for managing PIT entries in efficient manner. A specific research methodology is followed to ensure that the work is rigorous in achieving the aim of the study. The network simulation tool is used to design and evaluate PITCM. The results of study show that PITCM outperforms the performance of standard NDN PIT with 45% higher Interest satisfaction rate, 78% less Interest retransmission rate and 65% less Interest drop rate. In addition, Interest satisfaction delay and PIT length is reduced significantly to 33% and 46%, respectively. The contribution of this study is important for Interest packet management in NDN routing and forwarding systems. The AVPIT and STIL mechanisms as well as the HLLR policy can be used in monitoring, controlling and managing the PIT contents for Internet architecture of the future

Adaptive Interest Lifetime in Named Data Networking to Support Disaster Area

Pending Interest Table (PIT) in Named Data Network (NDN) maintains a track of forwarded Interest packets so that the returned Data packet can be sent to its subscriber(s). PIT size is a crucial parameter, which can have a huge impact on the number of both satisfied and timed out Interest packet, and consequently, on the number of packet delay in terms of PIT overflow. There are a lot of studies focusing on caching, applications, and security to make NDN getting perfect, while the management of PIT is still one of the primary concerns of high-speed forwarding. Thus, PIT manages mechanism is one of the most important design specifics that have not been studied in the context of NDN to a significant extent. NDN needs to define concise mechanisms to monitor traffic when multiple users contend for access to the same or different resources, which may lead the PIT is overflowing and as a result increasing the delay. In order that, the objective of this study is to provide an adaptive mechanism under network load, namely Smart Threshold Interest Lifetime (STIL) to adjust incoming Interest packet in the early phase of occurrence to propose possible response decisions to realize PIT overflow recovery. The ndnSIM network simulator was used to measure the STIL. The results demonstrate that the proposed mechanism outperforms the performance of standard NDN PIT with respect to average Interest lifetime, Interest satisfaction, Interest retransmission and Interest satisfaction delay. The significance of this study is to provide a fundamental direction of a new adaptive Interest lifetime mechanism in NDN router to decrease the delay, especially on the natural disaster in a city, which will be very much useful for emergency operation centers, emergency rescue teams, and citizens

Performance evaluation of TCP, UDP and DCCP traffic over 4G network

Fourth Generation (4G) mobile systems has been used more widely than the older generations 3G and 2G. Among the reasons are that the 4G’s transfer rate is higher and it supports all multimedia functions.Besides, its’ supports for wide geographical locus makes wireless technology gets more advanced.The essential goal of 4G is to enable voice-based communication being implemented endlessly.This study tries to evaluate if the old protocols suit with this new technology.And which one has the best performance and which one has the greatest effect on throughput, delay and packet loss.The aforementioned questions are crucial in the performance evaluation of the most famous protocols (particularly User Datagram Protocol (UDP), Transmission Control Protocol (TCP) and Datagram Congestion Control Protocol (DCCP)) within the 4G environment.Through the Network Simulation-3 (NS3), the performance of transporting video stream including throughput, delay, packet loss and packet delivery ratio are analyzed at the base station through UDP, TCP and DCCP protocols over 4G’s Long Term Evaluation (LTE) technology.The results show that DCCP has better throughput and lesser delay, but at the same time it has more packet loss than UDP and TCP. Based on the results, DCCP is recommended as a transport protocol for real time video

Using NDN in improving energy efficiency of MANET

This paper seeks to extol the virtues of named data networking (NDN), as an alternative to host-centric networking (HCN), for its prominent features that can be taken advantage of to significantly reduce energy consumption demands in a mobile ad hoc network (MANET) implementation. Therefore, a NDN-based content routing mechanism was compared with two types of HCN routing protocol implementations in this study: OLSR and Batman-adv. The experimental results obtained from this research provide early evidence that NDN can increase the energy efficiency of MANETcompared to the use ofHCNprimarily TCP/IP on the network stack solution for MANET. Of particular note would be NDN-based content routing’s viability as a solution for energy consumption issues that plague wireless multi-hop ad hoc networks. Last but not least, this paper also provides the future research direction that could be undertaken on the subject

A Taxonomy of Information-Centric Networking Architectures based on Data Routing and Name Resolution Approaches

This study presents a vast coverage of current Information-Centric Network (ICN) submission by evaluating eight distinct and popular routing and name resolution approaches. Internet build-up and initial deposition were based on a host-driven approach. With the increasing demands for mediadriven data flooding the cost of the Internet, a new semantic and paradigm shift was envisioned known as ICN. InformationCentrism is an approach that partly dissociates the host dependencies by referring to contents by unique identifiers called name. However, to benefit from the content network, forwarding, naming and routing, among other issues are still in its developmental stages. The taxonomy serves as a basis for research directions, challenges, implementation and future studies for standardizing the ICN routing and naming. Routing and Name Resolution were themed in categories of strategies, contributions, issues and drawbacks. The major findings of this paper are providing a classification and review of the data routing and name resolutions approaches that are proposed on eight ICN architectures; presenting drawback areas in the selected architectures; and finally highlighting some challenges of ICN routing for the ICN research community vending

Hybrid bat-ant colony optimization algorithm for rule-based feature selection in health care

Rule-based classification in the field of health care using artificial intelligence provides solutions in decision-making problems involving different domains. An important challenge is providing access to good and fast health facilities. Cervical cancer is one of the most frequent causes of death in females. The diagnostic methods for cervical cancer used in health centers are costly and time-consuming. In this paper, bat algorithm for feature selection and ant colony optimization-based classification algorithm were applied on cervical cancer data set obtained from the repository of the University of California, Irvine to analyze the disease based on optimal features. The proposed algorithm outperforms other methods in terms of comprehensibility and obtains better results in terms of classification accuracy

Review of name resolution and data routing for information centric networking

Information Centric Networking (ICN) a future Internet, presents a new paradigm by shifting the current network to the modern network protocols. Its goal, to improve the traditional network operations by enabling ICN packet routing and forwarding based on names.This shift will bring advantages, but at the same time, it is leading to a big challenge on routing approaches to implement ICN nodes. Routing approaches must use special techniques to publish messages to all the network nodes.Flooding approach is an easy and stateless, however, results in control overhead, depending on the network size.Moreover, designing, implementing, and evaluating routing approaches with higher capacity is really a key challenge in the overall ICN research area, because the state of ICN brings a significant cost; both in packet processing and router storage.Many approaches were proposed in the literatures over these years for the efficient control of forwarding on the network.This paper provides a classification and review of the routing mechanisms that are proposed on six ICN architectures.A summary in tabular form and a comparative study of these six architectures is also given in the paper as well as few open research challenges are highlighted

Performance evaluation of the replacement policies for pending interest table

Information (content) plays an important role in a Named Data Networking (NDN). Hence, an information model is essential in representing information appropriately to supports meaningful information spreading. As a distinction from the current network practice, the NDN shall concentrate on the content itself, rather than the location of the information itself. One important and common feature of NDN is leveraging through its built-in network caches (temporal store) to improve the communication and efficiency of content dissemination. Thus, caching is well thought-out as one of the most crucial features (especially in PIT) of the NDN. Its efficiency is due to it required feature of producing a flexible strategy in deciding what content to store and replace when the PIT overflows. Thus, PIT management in NDN continues being one of the primary concerns of high-speed forwarding. To address this issue, replacement policies, as one of the key factors for determining the effectiveness of a PIT in line with many researcher's haven to propose numerous replacement policies, i.e. LRU, Random and Persistent, which have been projected to attain the improved Interest drop rate, reduce the delay and Interest retransmission as when the PIT is full. However, to the best of our knowledge, there have not been studies that dealt with the performance and evaluation between the mentioned policies under different network topologies. Therefore, in this paper we study the performance of Interest drop rate, delay and Interest retransmission under different network topologies, i.e. Tree, Abilene and Germany when the PIT is full. The significance yearned for this study would be to provide a solid starting point in research directions of new PIT replacement policies for contemporary workload or selectively turning off of fewer used cache ways

Resource allocation mechanisms in computational grid: a survey

Nowadays, the electronic resources are available almost in every institution or facility.These electronic resources could be CPU, memory, electrical devices and so on.Most of these resources are wasted or not completely utilized. Hence, the role of Computational Grid comes.Grid Computing focuses on computing resources (such as CPU), in order to achieve a huge task in a short time.Due to the high heterogeneity in Grid environment, proposing an optimal resource allocation mechanism that can work in all scenarios is a dilemma.This paper presents a critical review about some of the most widely known and recently proposed mechanisms in Grid Computing.Thus, it will give the researchers an idea about the features of the most recent and used resource allocation mechanisms in Grid

Internet protocol MANET vs named data MANET: A critical evaluation

Many researches have been done in the field of mobile networking, specifically in the field of ad-hoc networks.The major aim of these networks is the delivery of data to a given node at the destination, irrespective of its location.Mobile Ad-hoc Network (MANET) employs the traditional TCP/IP structure to provide end-to-end communication between nodes (we named this type of architecture is IP-MANET).However, due to their mobility and the limited resource in wireless networks, each layer in the TCP/IP model requires redefinition or modifications to function efficiently in MANET. Named Data MANET (NDMANET) architecture is a recently emerging research area. The in-network chunk-based caching feature of NDN is beneficial in coping with the mobility and intermittent connectivity challenges in MANETs.In the natural disaster field, MANET is considered a challenging task because of the unpredictable changes in the network topology due to the absence of any centralized control.The goals of this paper have two ways: first, this study provides a performance comparison of IP-MANET to ND-MANET in terms of throughput, delay, and packet loss.While the second contribution is to identify which architecture has an impact on the natural disaster (i.e., Flooding disaster) in rural areas and suggests which one may perform better.For experimental purposes, our analyses IP-MANET and ND-MANET by extensive simulations in the NS 3 simulator under a number of different network scenarios, and show that how number of nodes and variety packets size affect their performance